Some new families of simple t-designs
نویسندگان
چکیده
Applying some methods of construction on existing i-designs, we obtain some infinite families of new simple designs. We give a table which contains many new simple designs in small cases. The main method which is called the union method, involves taking the union of every two blocks in a given design. We also combine this method with some other well known ones. Some of the new designs obtained are the following. If there exists a Hadamard matrix of order 4m, then there exists a simple 2-(4m 1, m, m(m 1)/2) design, a 2-(4m,m,(2m-1)(m-l)) design, a simple 3-(4m,2m-l,(m-l)(2m3)) design, and a simple 3-( 4m, 2m 2, (2m 3)( m 2)( m 1)) design. Finally if q is a prime power, then there exists a simple 2_(q2(q+ 2),q(2q+ l),q(q+ 1)(2q + 1)(2q 1)/2) design. We show that the number of non-isomorphic simple 2-(15,4,6) designs is at least 10.
منابع مشابه
Some Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملNew infinite families of 3-designs from preparata codes over Z4
We consider t-designs constructed from codewords in the Preparata code ~ ove r 2~4. A new approach is given to prove that the support (size 5) of minimum Lee weight codewords form a simple 3-design for any odd integer m >t 3. We also show that the support of codewords with support size 6 form four new families of simple 3-designs, with parameters (2",6,2" 8 ) , (2",6,5 (2 m-I 4)), (2m,6,20 • (2...
متن کاملBalanced part ternary designs: some new results
A balanced part ternary design (BPTD) is a balanced ternary design (BTD) with a specified number of blocks, say b2, each having repeated elements. We prove some necessary conditions on b2 and show the existence of some particular BPTDs. We also give constructions of infinite families of BPTDs with b1 = 0, including families of ternary t-designs with t ≥ 3.
متن کاملAn existence theorem for some simple t-designs
Dehon, M., An existence theorem for some simple t-designs, Discrete Mathematics 90 (1991) 137-142. Let S’ be a simple S;(t, k, [) containing b’ blocks and let S be a, not necessarily simple, $(t, 1. u); we prove that if b”(A 1) < (:), then there exists a simple &,(t, k, v). We apply this result to prove the existence of a new infinite family of 5-designs derived from the Alltop’s family of 5-de...
متن کاملA recursive construction for simple t−designs using resolution
This work presents a recursive construction for simple t-designs using resolutions of the ingredient designs. The result extends a construction of t-designs in our recent paper [39]. Essentially, the method in [39] describes the blocks of a constructed design as a collection of block unions from a number of appropriate pairs of disjoint ingredient designs. Now, if some pairs of these ingredient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 5 شماره
صفحات -
تاریخ انتشار 1992